An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects
نویسندگان
چکیده
Relative convex hulls have been suggested for multigridconvergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating 3D relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement.
منابع مشابه
An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experim...
متن کاملA Comparative Evaluation of Length Estimators
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experim...
متن کاملDesign and Manipulation 3D Imaging System by using Photodiode Grid
Introduction: Radiation imaging is one of the applicable methods in diagnostic medicine and nondestructive testing for industrial applications. In nondestructive 3D imaging, in addition to the radiation source, there is a requirement for a suitable detection system, data acquisition system, mechanical sections for moving objects, reconstruction algorithm and finally a computer for processing an...
متن کامل2DÿGrey-LevelÿConvexÿHullÿComputation: AÿDiscreteÿ3DÿApproach
We compute discrete convex hulls in 2D grey-level images, where we interpret grey-level values as heights in 3D landscapes. For these 3D objects, using a 3D binary method, we compute approximations of their convex hulls. Differently from other grey-level convex hull algorithms, producing results convex only in the geometric sense, our convex hull is convex also in the grey-level sense.
متن کاملSolving the \nearest Point on Object" Problem Using Recursive Subdivision Solving the \nearest Point on Object" Problem Using Recursive Subdivision
Finding the nearest point on a given 2D or 3D object computation is a problem that arises in many computer graphics applications, such as interactive modeling, rendering of implicit surfaces or collision detection. Unfortunately, for objects with complex geometry such as curves or surfaces, the computation cost becomes prohibitive as a minimization process acting in multiple dimensions has to b...
متن کامل